Covering orthogonal polygons with sliding k-transmitters
نویسندگان
چکیده
منابع مشابه
Covering Orthogonal Polygons with Sliding k-Transmitters
In this paper we consider a new variant of covering in an orthogonal art gallery problem where each guard is a sliding k-transmitter. Such a guard can travel back and forth along an orthogonal line segment, say s, inside the polygon. A point p is covered by this guard if there exists a point q ∈ s such that pq is a line segment normal to s and has at most k intersections with the polygon’s boun...
متن کاملOn Guarding Orthogonal Polygons with Sliding Cameras
A sliding camera inside an orthogonal polygon P is a point guard that travels back and forth along an orthogonal line segment γ in P . The sliding camera g can see a point p in P if the perpendicular from p onto γ is inside P . In this paper, we give the first constant-factor approximation algorithm for the problem of guarding P with the minimum number of sliding cameras. Next, we show that the...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملSliding k-Transmitters: Hardness and Approximation
A sliding k-transmitter in an orthogonal polygon P is a mobile guard that travels back and forth along an orthogonal line segment s inside P . It can see a point p ∈ P if the perpendicular from p onto s intersects the boundary of P at most k times. We show that guarding an orthogonal polygon P with the minimum number of k-transmitters is NP-hard, for any fixed k > 0, even if P is simple and mon...
متن کاملCovering Grids and Orthogonal Polygons with Periscope Guards
Gewali, L.P. and S. Ntafos, Covering grids and orthogonal polygons with periscope guards, Computational Geometry: Theory and Applications 2 (1993) 309-334. The problem of finding minimum guard covers is NP-hard for simple polygons and open for simple orthogonal polygons. Alternative definitions of visibility have been considered for orthogonal polygons. In this paper we try to determine the com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.02.008